Investigating semi-infinite programs using penalty functions and Lagrangian methods
نویسندگان
چکیده
منابع مشابه
Nonlinear Lagrangian Functions and Applications to Semi-Infinite Programs
In this paper a nonlinear penalty method via a nonlinear Lagrangian function is introduced for semi-infinite programs. A convergence result is established which shows that the sequence of optimal values of nonlinear penalty problems converges to that of semi-infinite programs. Moreover a conceptual convergence result of a discretization method with an adaptive scheme for solving semi-infinite p...
متن کاملOptimality Conditions for Semi-infinite and Generalized Semi-infinite Programs via lp Exact Penalty Functions
In this paper, we will study optimality conditions of semi-infinite programs and generalized semi-infinite programs, for which the gradient objective function when evaluated at any feasible direction for the linearized constraint set is non-negative. We consider three types of penalty functions for semi-infinite program and investigate the relationship among the exactness of these penalty funct...
متن کاملAugmented Lagrangian methods with smooth penalty functions
Since the late 1990s, the interest in augmented Lagrangian methods has been revived, and several models with smooth penalty functions for programs with inequality constraints have been proposed, tested and used in a variety of applications. Global convergence results for some of these methods have been published. Here we present a local convergence analysis for a large class of smooth augmented...
متن کاملPenalty and Smoothing Methods for Convex Semi-Infinite Programming
In this paper we consider min-max convex semi-infinite programming. In order to solve these problems we introduce a unified framework concerning Remez-type algorithms and integral methods coupled with penalty and smoothing methods. This framework subsumes well-known classical algorithms, but also provides some new methods with interesting properties. Convergence of the primal and dual sequences...
متن کاملSolving Semi-infinite Linear Programs Using Boosting-Like Methods
Linear optimization problems (LPs) with a very large or even infinite number of constraints frequently appear in many forms in machine learning. A linear program with m constraints can be written as min x∈P n c x with a where I assume for simplicity that the domain of x is the n dimensional probability simplex P n. Optimization problems with an infinite number of constraints of the form a j x ≤...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1986
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000005270